A measure of program nesting complexity

نویسنده

  • ELDON Y. LI
چکیده

For more than a decade, metrics of software complexity has been an intriguing topic for discussion. Many metrics have been proposed. Among them, the cyclomatic complexity metric is the easiest to understand and compute. In this paper, the cyclomatic complexity metric and its extensions are reviewed. The strengths and weaknesses of the cyclomatic metric are identified. One of the major weaknesses of the cyclomatic metric as well as its extensions is that they are insensitive to the level of nesting within various constructs. To remove this shortcoming, a "nesting" com­ plexity metric is proposed. The process of deriving this new metric is described in this paper. This new metric is proved to be superior to the cyclomatic metric in reflecting program complexity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Measurement of Complexity and Comprehension of a Program Through a Cognitive Approach

The inherent complexity of the software systems creates problems in the software engineering industry. Numerous techniques have been designed to comprehend the fundamental characteristics of software systems. To understand the software, it is necessary to know about the complexity level of the source code. Cognitive informatics perform an important role for better understanding the complexity o...

متن کامل

Cyclomatic Complexity: theme and variations

Focussing on the "McCabe family" of measures for the decision/logic structure of a program, leads to an evaluation of extensions to modularization, nesting and, potentially, to object-oriented program structures. A comparison of rated, operating and essential complexities of programs suggests two new metrics: 'inessential complexity" as a measure of unstructuredness and "product complexity" as ...

متن کامل

The Garland Measure and Computational Complexity of Stack Programs

A key problem in implicit computational complexity is to analyse the impact on program run times of nesting restricted control structures, such as for-do statements in imperative languages. This problem has two aspects. One is whether there are methods of extracting information from the syntax of such programs that give insight as to why some nesting of control structures may cause a blow up in...

متن کامل

Fuzzy Complexity Analysis with Conflict Resolution for Educational Projects

Evaluative and comparative analysis among educational projects remains an issue for administration, program directors, instructors, and educational institutes. This study reports a fuzzy complexity model for educational projects, which has two primary aspects (technical aspects and transparency aspects). These aspects may not be measured precisely due to uncertain situations. Therefore, a fuzzy...

متن کامل

A New Weighted Composite Complexity Measure for Object-Oriented Systems

Controlling and minimizing software complexity is the most important objective of each software development paradigm because it affects all other software quality attributes like reusability, reliability, testability, maintainability etc. For this purpose, a number of software complexity measures have been reported to quantify different aspects of complexity. As the development of object-orient...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010